A deduction theorem for restricted generality.
نویسندگان
چکیده
منابع مشابه
The Deduction Theorem
Here φ and ψ are any schemata and Γ is a (possibly empty) set of schemata. The Deduction Theorem, we shall see, is a very nice feature of an axiomatic system, for it allows one to discover theorems much more readily than ordinarily is possible by building actual proofs. Its true value lies elsewhere than in efficiency, though. At the end of this note we will discuss the importance of the Deduct...
متن کاملDeduction Theorem for Symmetric Cirquent Calculus
Cirquent calculus is a recent approach to proof theory, whose characteristic feature is being based on circuit-style structures (called cirquents) instead of the traditional formulas or sequents. In this paper we prove the deduction theorem for the symmetric version of cirquent calculus, and show that the derivation in the deduction theorem will be at most polynomially longer than the proof of ...
متن کاملThe Normalization Theorem for Extended Natural Deduction
The normalization theorem for the system of extended natural deduction will be proved as a consequence of the cut-elimination theorem, by using the connections between the system of extended natural deduction and a standard system of sequents.
متن کاملThe Scope and Generality of Bell’s Theorem
I present a local, deterministic model of the EPR-Bohm experiment, inspired by recent work by Joy Christian, that appears at first blush to be in tension with Bell-type theorems. I argue that the model ultimately fails to do what a hidden variable theory needs to do, but that it is interesting nonetheless because the way it fails helps clarify the scope and generality of Bell-type theorems. I f...
متن کاملA Translation Theorem For Restricted R-Formulas
The three-sorted formal system RLS described in [4] is like RLS(≺) in [5] but without the ≺. IRLS is a strictly intuitionistic subsystem of RLS. This note gives a natural, syntactically defined translation φ mapping each restricted formula E with only number and lawlike sequence variables free, to a formula φ(E) containing only number and lawlike sequence variables, such that IRLS proves E ↔ φ(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1973
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093890997